Development of E-rickshaw driving cycle (ERDC) based on micro-trip segments using random selection and K-means clustering techniques
نویسندگان
چکیده
In India, auto rickshaws are the most convenient and cheapest mode of near-to-door transport in both rural urban areas. Such vehicles powered with internal combustion engines (ICEs) one main sources pollutants on corridors. One way to minimize tail-pipe emissions is use electric motors place ICE. To evaluate vehicle performance, energy consumption, driving behavior, optimal design management such vehicles, cycle an important tool. So far, only limited studies exist development a for e-rickshaw. Moreover, these concentrated traffic environment research accounting together remain unexplored. this study, real world data 100 trips e-rickshaw collected road stretch passing through setting. A high-end GPS logger was used collect kinematics as continuous speed profile, acceleration/deceleration, heading, position coordinates. Nine different characteristics representing actual conditions identified developing (ERDC). Two approaches, random selection k-means clustering explored arrive at best representative ERDC using micro-trips technique. The analysis results revealed that outperforms method additional benefit systematically. insights from study can be understand model performance e-rickshaw, terms consumption characteristics, compared other fossil-fuel driven automobiles.
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملSelection of K in K-means clustering
The K-means algorithm is a popular data-clustering algorithm. However, one of its drawbacks is the requirement for the number of clusters, K, to be specified before the algorithm is applied. This paper first reviews existing methods for selecting the number of clusters for the algorithm. Factors that affect this selection are then discussed and a new measure to assist the selection is proposed....
متن کاملEnhanced Clustering Based on K-means Clustering Algorithm and Proposed Genetic Algorithm with K-means Clustering
-In this paper targeted a variety of techniques, tactics and distinctive areas of the studies that are useful and marked because the crucial discipline of information mining technologies. The overall purpose of the system of statistics mining is to extract beneficial facts from a large set of information and changing it right into a shape that is comprehensible for in addition use. Clustering i...
متن کاملpersistent k-means: stable data clustering algorithm based on k-means algorithm
identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...
متن کاملRanking and Clustering Iranian Provinces Based on COVID-19 Spread: K-Means Cluster Analysis
Introduction: The Coronavirus has crossed geographical borders. This study was performed to rank and cluster Iranian provinces based on coronavirus disease (COVID-19) recorded cases from February 19 to March 22, 2020. Materials and Methods: This cross-sectional study was conducted in 31 provinces of Iran using the daily number of confirmed cases. Cumulative Frequency (CF) and Adjusted CF (ACF)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iatss Research
سال: 2021
ISSN: ['0386-1112']
DOI: https://doi.org/10.1016/j.iatssr.2021.07.001